Terminating Passage-Time Calculations on Uniformised Markov Chains

نویسندگان

  • Allan Clark
  • Stephen Gilmore
چکیده

Uniformisation[1, 2] is a key technique which allows modellers to extract passage-time quantiles/densities which in turn permits the plotting of probability density and cumulative distribution functions. Uniformisation converts a CTMC (Continuous-Time Markov Chain) into a DTMC (Discrete-Time Markov Chain) with equivalent semantics. This can be used to calculate the probability of completing a passage within a given time t by calculating the probability of completing the passage within a number of iterations, n, of the DTMC and then calculating the probability that the nth iteration is performed within time t. However to calculate the passage-time quantiles we desire we must theoretically perform this calculation for values of n from zero to infinity and sum the probabilities. This can be approximated by calculating for values of n from zero to some finite value if we know that larger values of n will yield negligible probabilities and hence add nothing significant to the summation. This paper discusses two important conditions which ensure that the approximation is appropriate while also reducing the amount of negligible values

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Aggregation and Numerical Techniques for Passage Time Calculations in Large semi-Markov Models

First-passage time densities and quantiles are important metrics in performance analysis. They are used in the analysis of mobile communication systems, web servers, manufacturing systems as well as for the analysis of the quality of service of hospitals and government organisations. In this report we look at computational techniques for the first-passage time analysis on highlevel models that ...

متن کامل

Asymptotic Variance of Passage Time Estimators in Markov Chains

We consider the problem of estimating passage times in stochastic simulations of Markov chains+ Two types of estimator are considered for this purpose: the “simple” and the “overlapping” estimator; they are compared in terms of their asymptotic variance+ The analysis is based on the regenerative structure of the process and it is shown that when estimating the mean passage time, the simple esti...

متن کامل

Distribution of First Passage Times for Lumped States in Markov Chains

First passage time in Markov chains is defined as the first time that a chain passes a specified state or lumped states. This state or lumped states may indicate first passage time of an interesting, rare and amazing event. In this study, obtaining distribution of the first passage time relating to lumped states which are constructed by gathering the states through lumping method for a irreduci...

متن کامل

Transient calculations on process algebra derived Markov chains

The process of obtaining transient measures from a Markov chain as implemented in the software, ipclib is described. The software accepts models written in PEPA, Bio-PEPA or as a Petri net. In the case of the process algebras, a rich query specification language particularly well suited for the derivation of passage-time quantiles is provided. Such measurements are obtained from the derived Mar...

متن کامل

Extracting state-based performance metrics using asynchronous iterative techniques

Solution of large sparse linear fixed-point problems lies at the heart of many important performance analysis calculations. These calculations include steady-state, transient and passage-time computations in discrete-time Markov chains, continuous-time Markov chains and semi-Markov chains. In recent years, much work has been done to extend the application of asynchronous iterative solution meth...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2008